Viterbi decoding algorithm for convolutional codes with repeat request

Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resuking performance is analyzed by random coding aud generatiug function arguments and by simtdation. It is &own that the reliability function of tbe proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical situatious the proposed algorithm can save about SO percent in coustraint length over the ordinary Viterbi algorithm for a given performance.